Reduced Second Hyper-Zagreb Index and its Polynomial of Certain Silicate Networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hyper-Zagreb Index of Graph Operations

Let G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian p...

متن کامل

The Hyper-Zagreb Index of Trees and Unicyclic Graphs

Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.

متن کامل

A note on hyper-Zagreb index of graph operations

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

متن کامل

On the second order first zagreb index

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...

متن کامل

Hyper Zagreb Index of Bridge and Chain Grpahs

Let G be a simple connected molecular graph with vertex set V(G) and edge set E(G). One important modification of classical Zagreb index, called hyper Zagreb index HM(G) is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms 2 [ ( ) ( )] G G d u d v  over all the edges of G, where ( ) G d u denote the degree of the vetex u of G. In this paper, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics and Informatics

سال: 2018

ISSN: 2349-0632

DOI: 10.22457/jmi.v14a2